import java.util.HashMap;
import java.util.Map;
public class Solution {
    /**
     * @param paragraph:
     * @param banned:
     * @return: nothing
     */
    public static String mostCommonWord(String paragraph, String[] banned) {
        String s = paragraph.toLowerCase();
        char[] ss = s.toCharArray();
        HashMap<String,Integer> hash  = new HashMap();
        int start = 0;
        int end =0;
        for(int i = 0;i<ss.length;i++){
            if(ss[i] != ' ' && ss[i] != ',' && ss[i] != '!' && ss[i] != '?' && ss[i] != '\'' && ss[i] != '.' && ss[i]!=';' ){
                end++;
            }else{
                String str = s.substring(start,end);
                if(!str.equals("")){
                    hash.put(str,hash.getOrDefault(str,0)+1);
                }

                start = i+1;
                end++;
            }


        }
        String str = s.substring(start,end);
        if(!str.equals("")){
            hash.put(str,hash.getOrDefault(str,0)+1);
        }

        for(int i =0;i<banned.length;i++){
            hash.remove(banned[i]);
        }





        String keyWithMaxValue = getKeyWithMaxValue(hash);


        return keyWithMaxValue;


    }
    public static String getKeyWithMaxValue(HashMap<String, Integer> map) {
        String maxKey = null;
        int maxValue = Integer.MIN_VALUE;

        for (Map.Entry<String, Integer> entry : map.entrySet()) {
                if (entry.getValue() > maxValue) {
                    maxValue = entry.getValue();
                    maxKey = entry.getKey();
                }
        }

        return maxKey;
    }

    public static void main(String[] args) {
        String sss = "\"L, P! X! C; u! P? w! P. G, S? l? X? D. w? m? f? v, x? i. z; x' m! U' M! j? V; l. S! j? r, K. O? k? p? p, H! t! z' X! v. u; F, h; s? X? K. y, Y! L; q! y? j, o? D' y? F' Z; E? W; W' W! n! p' U. N; w? V' y! Q; J, o! T? g? o! N' M? X? w! V. w? o' k. W. y, k; o' m! r; i, n. k, w; U? S? t; O' g' z. V. N? z, W? j! m? W! h; t! V' T! Z? R' w, w? y? y; O' w; r? q. G, V. x? n, Y; Q. s? S. G. f, s! U? l. o! i. L; Z' X! u. y, Q. q; Q, D; V. m. q. s? Y, U; p? u! q? h? O. W' y? Z! x! r. E, R, r' X' V, b. z, x! Q; y, g' j; j. q; W; v' X! J' H? i' o? n, Y. X! x? h? u; T? l! o? z. K' z' s; L? p? V' r. L? Y; V! V' S. t? Z' T' Y. s? i? Y! G? r; Y; T! h! K; M. k. U; A! V? R? C' x! X. M; z' V! w. N. T? Y' w? n, Z, Z? Y' R; V' f; V' I; t? X? Z; l? R, Q! Z. R. R, O. S! w; p' T. u? U! n, V, M. p? Q, O? q' t. B, k. u. H' T; T? S; Y! S! i? q! K' z' S! v; L. x; q; W? m? y, Z! x. y. j? N' R' I? r? V! Z; s, O? s; V, I, e? U' w! T? T! u; U! e? w? z; t! C! z? U, p' p! r. x; U! Z; u! j; T! X! N' F? n! P' t, X. s; q'\""
     ;
        String[] a = new String[]{"m","i","s","w","y","d","q","l","a","p","n","t","u","b","o","e","f","g","c","x"};
       String s =  mostCommonWord(sss,a);
        System.out.println(s);
    }
}